Devising an efficient approach to determine the optimal sequence of from-to matrix

Sequencing is the most impact factor in many production areas, such as assembly lines, batch production, Travelling Salesman Problem (TSP), product sequences, process etc. The flow and analysis from one item to another can be presented by square matrix which number of rows or columns equal manipulated items, this special form called “From-To matrix”. suffers drawbacks when it applied determine optimal variables must small possible, there no flexibility start end sequence find best sequencing with some conditions. Also, possibility add relations point a variable wanted prevented sequence. In paper, we solve From-To binary linear programming (BLP). proposed BLP approach has been Ur company matrix. This line that manufacture four products: A, B, C, D, setup time considered goal get an optimum products minimum time. solution state transition using formulated following five model cases according requirement condition desired: first case gives all possible second lists items known, third last fourth prevents occurring undesired sequence, fifth desired Furthermore, found sequences for states determining also prevented. mathematical formulas under conditions are derived proved